A strategy for repetitive neighbor finding in images represented by quadtrees
نویسنده
چکیده
The paper presents an effective strategy for repetitive neighbor finding in binary images which is proper for mobile robot path planning, connected component labeling, etc. It is based on a new neighbor finding method which is universal and generates all the possible and arbitrary sized neighbors (larger, smaller, equal) for any quadtree node using simple algebraic operations. © 1997 Elsevier Science B.V.
منابع مشابه
Neighbor finding in images represented by octrees
Algorithms are presented for moving between adjacent blocks in an octree representation of an image. Motion is possible in the direction of a face, edge, and a vertex, and between blocks of arbitrary size. The algorithms are based on a generalization and simplification of techniques developed earlier for two dimensions (i.e., in quadtrees). They are also applicable to quadtrees. The difference ...
متن کاملParallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملHypercube algorithms for operations on quadtrees
This paper describes parallel algorithms for the following operations on qua.dtreesboolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a. hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the...
متن کاملSkript zur Vorlesung Hierarchische Strukturen in der Computergraphik∗
2 Quadtrees 2 2.1 Definition and Neighbor-Finding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Height Field Visualization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Isosurface Generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Ray Shooting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملFuzzy Neighbor Voting for Automatic Image Annotation
With quick development of digital images and the availability of imaging tools, massive amounts of images are created. Therefore, efficient management and suitable retrieval, especially by computers, is one of themost challenging fields in image processing. Automatic image annotation (AIA) or refers to attaching words, keywords or comments to an image or to a selected part of it. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 18 شماره
صفحات -
تاریخ انتشار 1997